An Augmented Lagrangian Approach to Constrained MAP Inference An Augmented Lagrangian Aproach to Constrained MAP Inference
ثبت نشده
چکیده
In this section, we derive in detail the closed form solution of problem (12) for binary pairwise factors (Sect. 4.1). Recall that the marginal polytope M(G a) is given by:
منابع مشابه
An Augmented Lagrangian Approach to Constrained MAP Inference
We propose a new algorithm for approximate MAP inference on factor graphs, which combines augmented Lagrangian optimization with the dual decomposition method. Each slave subproblem is given a quadratic penalty, which pushes toward faster consensus than in previous subgradient approaches. Our algorithm is provably convergent, parallelizable, and suitable for fine decompositions of the graph. We...
متن کاملAugmenting Dual Decomposition for MAP Inference
In this paper, we propose combining augmented Lagrangian optimization with the dual decomposition method to obtain a fast algorithm for approximate MAP (maximum a posteriori) inference on factor graphs. We also show how the proposed algorithm can efficiently handle problems with (possibly global) structural constraints. The experimental results reported testify for the state-of-the-art performa...
متن کاملLinear Approximation to ADMM for MAP inference
Maximum a posteriori (MAP) inference is one of the fundamental inference tasks in graphical models. MAP inference is in general NP-hard, making approximate methods of interest for many problems. One successful class of approximate inference algorithms is based on linear programming (LP) relaxations. The augmented Lagrangian method can be used to overcome a lack of strict convexity in LP relaxat...
متن کاملGreedy Direction Method of Multiplier for MAP Inference of Large Output Domain
Maximum-a-Posteriori (MAP) inference lies at the heart of Graphical Models and Structured Prediction. Despite the intractability of exact MAP inference, approximate methods based on LP relaxations have exhibited superior performance across a wide range of applications. Yet for problems involving large output domains (i.e., the state space for each variable is large), standard LP relaxations can...
متن کاملModeling an Augmented Lagrangian for Improved Blackbox Constrained Optimization
Constrained blackbox optimization is a difficult problem, with most approaches coming from the mathematical programming literature. The statistical literature is sparse, especially in addressing problems with nontrivial constraints. This situation is unfortunate because statistical methods have many attractive properties: global scope, handling noisy objectives, sensitivity analysis, and so for...
متن کامل